Words with prescribed adjacencies
نویسندگان
چکیده
منابع مشابه
Adjacencies in Words
Based Based on on two two inversion inversion formulas formulas for for enumerating enumerating words words in in the the free free monoid monoid by by adjacencies, adjacencies, we we present present a a new new approach approach to to a a class class of of permutation permutation problems problems having having Eulerian-type Eulerian-type generating generating functions. functions. We We also ...
متن کاملRestricted words by adjacencies
A recurrence, a determinant formula, and generating functions are presented for enumerating words with restricted letters by adjacencies. The main theorem leads to re nements (with up to two additional parameters) of known results on compositions, polyominoes, and permutations. Among the examples considered are (1) the introduction of the ascent variation on compositions, (2) the enumeration of...
متن کاملComplexity of Road Coloring with Prescribed Reset Words
By the Road Coloring Theorem (Trahtman, 2008), the edges of any given aperiodic directed multigraph with a constant out-degree can be colored such that the resulting automaton admits a reset word. There may also be a need for a particular reset word to be admitted. For certain words it is NP-complete to decide whether there is a suitable coloring. For the binary alphabet, we present a classific...
متن کاملOn Eulerian Circuits and Words with Prescribed Adjacency Patterns
In the study of the biochemistry of the DNA molecule [l-3], of the statistical mechanics of large molecules in general [4], and elsewhere, one is led to postulate models of behavior in which the molecule is treated like a “word,” and the individual bases arranged on the molecule are the “letters.” A useful simplifying assumption is then that the informationcarrying properties of these molecules...
متن کاملUniformly balanced words with linear complexity and prescribed letter frequencies
We consider the following problem. Let us fix a finite alphabet A = {1,2, · · · ,d}; for any d-uple of letter frequencies ( f1, · · · , fd) ∈ [0,1]d with ∑i=1 fi = 1, how to construct an infinite word u over the alphabet A satisfying the following conditions: u has linear complexity function, u is uniformly balanced, the letter frequencies in u are given by ( f1, · · · , fd). This paper investi...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 1979
ISSN: 0095-8956
DOI: 10.1016/0095-8956(79)90046-7